LP-based online scheduling: from single to parallel machines
نویسندگان
چکیده
منابع مشابه
LP-Based Online Scheduling: From Single to Parallel Machines
We study classic machine sequencing problems in an online setting. Specifically, we look at deterministic and randomized algorithms for the problem of scheduling jobs with release dates on identical parallel machines, to minimize the sum of weighted completion times: Both preemptive and non-preemptive versions are analyzed. Using linear programming techniques, borrowed from the single machine c...
متن کاملOnline Preemptive Scheduling on Parallel Machines
We consider an online version of the classical problem of preemptive scheduling on uniformly related machines. We are given m machines with speeds s 1 ≥ s 2 ≥. .. ≥ s m and a sequence of jobs, each described by its processing time (length). The actual time needed to process a job with length p on a machine with speed s is p/s. In the preemptive version, each job may be divided into several piec...
متن کاملStochastic Online Scheduling on Parallel Machines
We propose a model for non-preemptive scheduling under uncertainty. In this model, we combine the main characteristics of online and stochastic scheduling in a simple and natural way. Job processing times are assumed to be stochastic, but in contrast to the traditional stochastic scheduling models, we assume that jobs arrive online over time, and there is no knowledge about the jobs that will a...
متن کاملFlexible flowshop scheduling with equal number of unrelated parallel machines
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
متن کاملSolving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization
This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2008
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-007-0204-7